Learning probabilistic automata and Markov chains via queries
نویسندگان
چکیده
منابع مشابه
Probabilistic XML via Markov Chains
We show how Recursive Markov Chains (RMCs) and their restrictions can define probabilistic distributions over XML documents, and study tractability of querying over such models. We show that RMCs subsume several existing probabilistic XML models. In contrast to the latter, RMC models (i) capture probabilistic versions of XML schema languages such as DTDs, (ii) can be exponentially more succinct...
متن کاملProbabilistic Modeling of Academic Dishonesty via Markov Chains
Academic dishonesty is modeled via Markov chains. The case of student behavior in class assignments, quizzes and exams is analyzed in modeling examples with various levels of surveillance. The choice of modeling based on surveillance and sanctions is motivated by the research literature on the deterrence theory analysis of cheating. In addition, it is shown how surveillance and sanctions could ...
متن کاملMarkov Chains and Unambiguous Büchi Automata
Unambiguous automata, i.e., nondeterministic automata with the restriction of having at most one accepting run over a word, have the potential to be used instead of deterministic automata in settings where nondeterministic automata can not be applied in general. In this paper, we provide a polynomially time-bounded algorithm for probabilistic model checking of discrete-time Markov chains agains...
متن کاملp-Automata: Acceptors for Markov Chains
We present p-automata, which accept an entire Markovchain as input. Acceptance is determined by solving a se-quence of stochastic weak and weak games. The set oflanguages of Markov chains obtained in this way is closedunder Boolean operations. Language emptiness and con-tainment are equi-solvable, and languages themselves areclosed under bisimulation. A Markov chain (res...
متن کاملLearning Probabilistic Finite Automata
Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We report here a number of results concerning the learnability of these finite state machines. In the setting of identification in the limit with probability one, we prove that stochastic deterministic finite automata cannot be identified from only a polynomial quantity of data. If concerned wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 1992
ISSN: 0885-6125,1573-0565
DOI: 10.1007/bf00992862